Efficient Sampling Method for Monte Carlo Tree Search Problem
نویسندگان
چکیده
منابع مشابه
Efficient Sampling Method for Monte Carlo Tree Search Problem
We consider Monte Carlo tree search problem, a variant of Min-Max tree search problem where the score of each leaf is the expectation of some Bernoulli variables and not explicitly given but can be estimated through (random) playouts. The goal of this problem is, given a game tree and an oracle that returns an outcome of a playout, to find a child node of the root which attains an approximate m...
متن کاملMonte-Carlo Tree Search
representation of the game. It was programmed in LISP. Further use of abstraction was also studied by Friedenbach (1980). The combination of search, heuristics, and expert systems led to the best programs in the eighties. At the end of the eighties a new type of Go programs emerged. These programs made an intensive use of pattern recognition. This approach was discussed in detail by Boon (1990)...
متن کاملMonte-Carlo Tree Search for the Multiple Sequence Alignment Problem
The paper considers solving the multiple sequence alignment, a combinatorial challenge in computational biology, where several DNA RNA, or protein sequences are to be arranged for high similarity. The proposal applies randomized MonteCarlo tree search with nested rollouts and is able to improve the solution quality over time. Instead of learning the position of the letters, the approach learns ...
متن کاملMonte-Carlo Tree Search for the Physical Travelling Salesman Problem
The significant success of MCTS in recent years, particularly in the game Go, has led to the application of MCTS to numerous other domains. In an ongoing effort to better understand the performance of MCTS in open-ended realtime video games, we apply MCTS to the Physical Travelling Salesman Problem (PTSP). We discuss different approaches to tailor MCTS to this particular problem domain and subs...
متن کاملA New Method for Parallel Monte Carlo Tree Search
In recent years there has been much interest in the Monte Carlo tree search algorithm, a new, adaptive, randomized optimization algorithm. In fields as diverse as Artificial Intelligence, Operations Research, and High Energy Physics, research has established that Monte Carlo tree search can find good solutions without domain dependent heuristics. However, practice shows that reaching high perfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2014
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e97.d.392